A geometric projection-space reconstruction algorithm
نویسندگان
چکیده
منابع مشابه
A Geometric Projection-Space Reconstruction Algorithm*
We present a method to reconstruct images from finite sets of noisy projections that may be available only over limited or sparse angles. The algorithm calculates the maximum a posteriori (MAP) estimate of the full sinogram (which is an image of the 2-D Radon transform of the object) from the available data. It is implemented using a primal-dual constrained optimization procedure that solves a ...
متن کاملComparing IDREAM as an Iterative Reconstruction Algorithm against In Filtered Back Projection in Computed Tomography
Introduction: Recent studies of Computed Tomography (CT) conducted on patient dose reduction have recommended using an iterative reconstruction algorithm and mA (mili-Ampere) dose modulation. The current study aimed to evaluate Iterative Dose Reduction Algorithm (IDREAM) as an iterative reconstruction algorithm. Material and Methods: Two CT p...
متن کاملA Novel Super-resolution Reconstruction Algorithm Based on Subspace Projection
REGULAR PAPERS A Novel Super-resolution Reconstruction Algorithm based on Subspace Projection Wei-long Chen, Li Guo, and Wen-long Xia Network Coding-based Directional Scheduling for Fairness Provisioning in Wireless Mesh Networks Yafei Hu, Fangmin Li, and Xinhua Liu Sentiment Recognition of Online Chinese Micro Movie Reviews Using Multiple Probabilistic Reasoning Model Wei Xu, Zhi Liu, Tai Wang...
متن کاملAn iterative projection-space reconstruction algorithm for tomography systems with irregular coverage
Most standard tomographic inversion methods require many measurements with a regular coverage of the object studied. A new method has been developed to obtain tomographic reconstructions from measurements by systems with a small number of detectors and an irregular coverage. The method reconstructs values on a regular grid in projection space from the measurements on an irregular grid by an ite...
متن کاملA Geometric Space-Time Multigrid Algorithm for the Heat Equation
We study the time-dependent heat equation on its space-time domain that is discretised by a k-spacetree. k-spacetrees are a generalisation of the octree concept and are a discretisation paradigm yielding a multiscale representation of dynamically adaptive Cartesian grids with low memory footprint. The paper presents a full approximation storage geometric multigrid implementation for this settin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1990
ISSN: 0024-3795
DOI: 10.1016/0024-3795(90)90211-t